The three dimensional polyominoes of minimal area
نویسندگان
چکیده
The set of the three dimensional polyominoes of minimal area and of volume n contains a polyomino which is the union of a quasicube j × (j + δ) × (j + θ), δ, θ ∈ {0, 1}, a quasisquare l × (l + ), ∈ {0, 1}, and a bar k. This shape is naturally associated to the unique decomposition of n = j(j +δ)(j +θ)+ l(l+ )+k as the sum of a maximal quasicube, a maximal quasisquare and a bar. For n a quasicube plus a quasisquare, or a quasicube minus one, the minimal polyominoes are reduced to these shapes. The minimal area is explicitly computed and yields a discrete isoperimetric inequality. These variational problems are the key for finding the path of escape from the metastable state for the three dimensional Ising model at very low temperatures. The results and proofs are illustrated by a lot of pictures. 1991 Mathematics Subject Classification. 05B50 51M25 82C44.
منابع مشابه
0 M ar 2 00 4 Enumeration of Symmetry Classes of Convex Polyominoes on the Honeycomb Lattice ∗
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the generating series of free (i.e. up to reflection and rotation) and of asymmetric convex hexagonal polyominoes, according to area and half-perimeter. We give explici...
متن کاملThe Reconstruction of Some 3D Convex Polyominoes from Orthogonal Projections
The reconstruction of discrete twoor three-dimensional sets from their orthogonal projections is one of the central problems in the areas of medical diagnostics, computer-aided tomography, and pattern recognition. In this paper we will give a polynomial algorithm for reconstruction of some class of convex three-dimensional polyominoes that has time complexity .
متن کاملEnumeration of minimal 3D polyominoes inscribed in a rectangular prism
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size b×k×h and of minimal volume equal to b + k + h − 2. They extend the concept of minimal 2D polyominoes inscribed in a rectangle studied in a previous work. Using their geometric structur...
متن کاملEnumeration of symmetry classes of convex polyominoes on the honeycomb lattice
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the generating series of free (i.e. up to reflection and rotation) and of asymmetric convex hexagonal polyominoes, according to area and half-perimeter. We give explici...
متن کاملPunctured polygons and polyominoes on the square lattice
We use the finite lattice method to count the number of punctured staircase and selfavoiding polygons with up to three holes on the square lattice. New or radically extended series have been derived for both the perimeter and area generating functions. We show that the critical point is unchanged by a finite number of punctures, and that the critical exponent increases by a fixed amount for eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 3 شماره
صفحات -
تاریخ انتشار 1996